Optimal Task Scheduling of a Complete K-Ary Tree with Communication Delays
نویسندگان
چکیده
It is known that task scheduling problem of a complete kary intree with unit time tasks and general communication delays onto an unlimited number of processors is NP-complete. In this paper, we show that such a problem can be solved in linear time if we restrict communication delays within the range from (k− 1) to k unit times. We also show that naive scheduling is optimal if communication delays are constant and at most (k − 1) unit times.
منابع مشابه
Near-Optimal Task Scheduling of a Complete K-ary Tree with Communication Delays
It is known that task scheduling problem of an intree with unit time tasks and unit time communication delays onto a limited number of processors is NP-hard. In this paper, we show that such a problem is approximable within a factor of 3 if we assume a complete k-ary intree with at most (k − 1) constant communication delay. Also we prove that the problem is approximable within a factor of 2 if ...
متن کاملScheduling Trees with Communication Delays
Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP-complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown that the problem remains NP-complete for binary trees with uniform communication delays. The same hold...
متن کاملScheduling Complete Intrees on Two Uniform Processors with Communication Delays
In this paper we present an optimal algorithm for scheduling complete k-ary tree on two uniform processors of di erent speeds in order to minimize schedule length. We consider the basic case of unit standard execution times and unit communication times.
متن کاملAn Optimal Placement of a Liaison between Two Levels in an Organization Structure of a Complete K-ary Tree
This paper proposes a model of placing a liaison which forms relations to two members of different levels in a pyramid organization structure such that the communication of information between every member in the organization becomes the most efficient. For the model of adding a node of liaison which gets adjacent to a node with a depth M and its descendant with a depth N in a complete K-ary tr...
متن کاملAdding Edges between One Node and Every Other Node with the Same Depth in a Complete K-ary Tree
This paper proposes a model of adding relations between members of the same level in a pyramid organization structure which is a complete K-ary tree such that the communication of information between every member in the organization becomes the most efficient. When edges between one node and every other node with the same depth N in a complete K-ary tree of height H are added, an optimal depth ...
متن کامل